Kryptographische Protokolle The Decision Diffie-Hellman Problem
نویسنده
چکیده
The Diffie-Hellman key agreement protocol, is a procedure that allows establishing a shared secret over an insecure connection and was developed by Whitfield Diffie and Martin Hellman in 1976, . This procedure is, often slightly modified, still used today by several applications. Before going into more detail on these applications, let’s have a look at the basic key-exchange method between two users Alice and Bob, where Alice is the one initiating the exchange:
منابع مشابه
Diffie-Hellman type key exchange protocols based on isogenies
In this paper, we propose some Diffie-Hellman type key exchange protocols using isogenies of elliptic curves. The first method which uses the endomorphism ring of an ordinary elliptic curve $ E $, is a straightforward generalization of elliptic curve Diffie-Hellman key exchange. The method uses commutativity of the endomorphism ring $ End(E) $. Then using dual isogenies, we propose...
متن کاملObstacles to the torsion-subgroup attack on the decision Diffie-Hellman Problem
Cheng and Uchiyama show that if one is given an elliptic curve, depending on a prime p, that is defined over a number field and has certain properties, then one can solve the Decision Diffie-Hellman Problem (DDHP) in Fp in polynomial time. We show that it is unlikely that an elliptic curve with the desired properties exists.
متن کاملEasy decision-Diffie-Hellman groups
The decision-Diffie-Hellman problem (DDH) is a central computational problem in cryptography. It is already known that the Weil and Tate pairings can be used to solve many DDH problems on elliptic curves. A natural question is whether all DDH problems are easy on supersingular curves. To answer this question it is necessary to have suitable distortion maps. Verheul states that such maps exist, ...
متن کاملA NEW PROTOCOL MODEL FOR VERIFICATION OF PAYMENT ORDER INFORMATION INTEGRITY IN ONLINE E-PAYMENT SYSTEM USING ELLIPTIC CURVE DIFFIE-HELLMAN KEY AGREEMENT PROTOCOL
Two parties that conduct a business transaction through the internet do not see each other personally nor do they exchange any document neither any money hand-to-hand currency. Electronic payment is a way by which the two parties transfer the money through the internet. Therefore integrity of payment and order information of online purchase is an important concern. With online purchase the cust...
متن کاملIrreducibility to the One-More Evaluation Problems: More May Be Less
For a random-self-reducible function, the evaluation problem is irreducible to the one-moreevaluation problem, in the following sense. An irreduction algorithm exists that, given a re-duction algorithm from the evaluation to the one-more evaluation problem, solves a separatorproblem: the evaluation problem itself. Another irreduction shows that if the computationalDiffie-Hellman...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011